binary heap

The data structure of full binary heap are used to get the shortest path value node and in which the new nodes are inserted in a queue .

采用满二叉堆数据结构对节点进行排序并选取最短路径节点，大大提高算法效率。

After analyzing the data structures commonly used by A algorithm , we get an implementation of the mixed use of binary heap and the associated table , which greatly improves the searching performance .

在分析了A算法常用的数据结构后，采用二叉堆和关联表混合实现的数据结构，从而极大地提高了算法的搜索性能。

This paper proposed an optimal Dijkstra algorithm which adopted the structure of binary heap and network side storage structure model .

该算法引入一种二叉堆数据结构来存储局部规划待考察的节点，通过减少局部寻优中比较的次数来提高搜索的速度。

Once you 've dumped the heap into a binary file , you can use jhat to analyze the binary heap dump file .

将堆转储至一个二进制文件后，您就可以使用jhat分析二进制堆转储文件。